List Decoding from Erasures: Bounds and Code Constructions
نویسنده
چکیده
منابع مشابه
On Optimal Erasure and List Decoding Schemes of Convolutional Codes
A modified Viterbi algorithm with erasures and list-decoding is introduced. This algorithm is shown to yield the optimal decoding rule of Forney with erasures and variable list-size. For the case of decoding with erasures, the optimal algorithm is compared to the simple algorithm of Yamamoto and Itoh. The comparison shows a remarkable similarity in simulated performance, but with a considerably...
متن کاملDecoding with Symbol Erasures , Errors and List Decisions
Vector Symbol Decoding (VSD) is compared with Reed-Solomon Decoding (RSD) as an outer code of a concatenated code for two examples, where the inner decoder may provide a combination of errors, erasures or list decisions for a symbol. One example is for idealized orthogonal inner code signals with random noise and soft inner code decisions. The other example is for multiple access fast frequency...
متن کاملOn Sequential Locally Repairable Codes Revised by Guangyue.dvi
We consider the locally repairable codes (LRC), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r < k) other code symbols. Here, a sequential recovering means that the erased symbols are r...
متن کاملOn Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملTwo Theorems in List Decoding
We prove the following results concerning the list decoding of error-correcting codes: 1. We show that for any code with a relative distance of δ (over a large enough alphabet), the following result holds for random errors: With high probability, for a ρ 6 δ− ε fraction of random errors (for any ε > 0), the received word will have only the transmitted codeword in a Hamming ball of radius ρ arou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2001